Proving Skipping Refinement with ACL2s
نویسندگان
چکیده
منابع مشابه
Proving Skipping Refinement with ACL2s
We describe three case studies illustrating the use of ACL2s to prove the correctness of optimized reactive systems using skipping refinement. Reasoning about reactive systems using refinement involves defining an abstract, high-level specification system and a concrete, low-level implementation system. Next, one shows that the behaviors of the implementation system are allowed by the specifica...
متن کاملSkipping Refinement
We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, highlevel specification system and a concrete, low-level implementation system. One then shows that every behavior allowed by the implementation is also allowed by the specification. Due to the difference i...
متن کاملRefinement and Theorem Proving
In this chapter, we describe the ACL2 theorem proving system and show how it can be used to model and verify hardware using refinement. This is a timely problem, as the ever-increasing complexity of microprocessor designs and the potentially devastating economic consequences of shipping defective products has made functional verification a bottleneck in the microprocessor design cycle, requirin...
متن کاملProving Component Interoperability with B Refinement
We use the formal method B for specifying interfaces of software components. Each component interface is equipped with a suitable data model defining all types occurring in the signature of interface operations. Moreover, preand postconditions have to be given for all interface operations. The interoperability between two components is proved by using a refinement relation between an adaptation...
متن کاملTactic Theorem Proving with Refinement-Tree Proofs and Metavariables
This paper describes a prototype of a programmable interactive theorem-proving system. The main new feature of this system is that it supports the construction and manipulation of tree-structured proofs that can contain both metavariables and derived rules that are computed by tactic programs. The proof structure encapsulates the top-down reenement process of proof construction typical of most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.192.9